Target-shaped possibilistic clustering applied to local-model identification
نویسندگان
چکیده
In this paper, application of possibilistic clustering techniques to identification of local linear models will be discussed. In particular, a generalisation of some possibilistic algorithms in the bibliography is obtained. With the presented procedures, a trade-off between an “expected shape” of the membership functions and model fit can be stated. Possibilistic clustering may allow for better detection of undermodelling and overmodelling than basic techniques based on fuzzy partitions.Copyright c ©2005 Elsevier.
منابع مشابه
Image Segmentation: Type–2 Fuzzy Possibilistic C-Mean Clustering Approach
Image segmentation is an essential issue in image description and classification. Currently, in many real applications, segmentation is still mainly manual or strongly supervised by a human expert, which makes it irreproducible and deteriorating. Moreover, there are many uncertainties and vagueness in images, which crisp clustering and even Type-1 fuzzy clustering could not handle. Hence, Type-...
متن کاملConvergence Theorems of Possibilistic Clustering Algorithms and Generalized Possibilistic Clustering Algorithms
A generalized approach to possibilistic clustering algorithms was proposed in [19], where the memberships are evaluated directly according to the data information using the fuzzy set theory, and the cluster centers are updated via a performance index. The computational experiments based on the generalized possibilistic clustering algorithms in [19] revealed that these clustering algorithms coul...
متن کاملAn Interactive Possibilistic Programming Approach to Designing a 3PL Supply Chain Network Under Uncertainty
The design of closed-loop supply chain networks has attracted increasing attention in recent decades with environmental concerns and commercial factors. Due to the rapid growth of knowledge and technology, the complexity of the supply chain operations is increasing daily and organizations are faced with numerous challenges and risks in their management. Most organizations with limited resources...
متن کاملOn the convergence of some possibilistic clustering algorithms
In this paper, an analysis of the convergence performance is conducted for a class of possibilistic clustering algorithms utilizing the Zangwill convergence theorem. It is shown that under certain conditions the iterative sequence generated by a possibilistic clustering algorithm converges, at least along a subsequence, to either a local minimizer or a saddle point of the objective function of ...
متن کاملAn Algorithm to Model Paradigm Shifting in Fuzzy Clustering
The graded possibilistic clustering paradigm includes as the two extreme cases the “probabilistic” assumption and the “possibilistic” assumption adopted by many clustering algorithms. We propose an implementation of a graded possibilistic clustering algorithm based on an interval equality constraint enforcing both the normality condition and the required graded possibilistic condition. Experime...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eng. Appl. of AI
دوره 19 شماره
صفحات -
تاریخ انتشار 2006